On Newton-hss Methods for Systems of Nonlinear Equations with Positive-definite Jacobian Matrices
نویسندگان
چکیده
The Hermitian and skew-Hermitian splitting (HSS) method is an unconditionally convergent iteration method for solving large sparse non-Hermitian positive definite system of linear equations. By making use of the HSS iteration as the inner solver for the Newton method, we establish a class of Newton-HSS methods for solving large sparse systems of nonlinear equations with positive definite Jacobian matrices at the solution points. For this class of inexact Newton methods, two types of local convergence theorems are proved under proper conditions, and numerical results are given to examine their feasibility and effectiveness. In addition, the advantages of the Newton-HSS methods over the Newton-USOR, the Newton-GMRES and the Newton-GCG methods are shown through solving systems of nonlinear equations arising from the finite difference discretization of a two-dimensional convection-diffusion equation perturbed by a nonlinear term. The numerical implementations also show that as preconditioners for the Newton-GMRES and the Newton-GCG methods the HSS iteration outperforms the USOR iteration in both computing time and iteration step. Mathematics subject classification: 65F10, 65W05.
منابع مشابه
Semilocal and global convergence of the Newton-HSS method for systems of nonlinear equations
Newton-HSS methods, that are variants of inexact Newton methods different from Newton-Krylov methods, have been shown to be competitive methods for solving large sparse systems of nonlinear equations with positive definite Jacobian matrices [Bai and Guo, 2010]. In that paper, only local convergence was proved. In this paper, we prove a Kantorovich-type semilocal convergence. Then we introduce N...
متن کاملSolving systems of nonlinear equations using decomposition technique
A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...
متن کاملA Globally Convergent Parallel Algorithm for Zeros of Polynomial Systems
POLYNOMIAL systems of equations frequently arise in solid modelling, robotics, computer vision, chemistry, chemical engineering, and mechanical engineering. Locally convergent iterative methods such as quasi-Newton methods may diverge or fail to find all meaningful solutions of a polynomial system. This paper proposes a parallel homotopy algorithm for polynomial systems of equations that is gua...
متن کاملAn Approximate Jacobian Nonlinear Solver for Multiphase Flow and Transport
We present an approximate Jacobian approach for solving nonlinear, multiphase flow and transport problems in porous media. A backward Euler time discretization scheme is used; prior to spatial discretization with a lowest order mixed finite element method (MFEM). This results in a fully implicit nonlinear algebraic system of equations. Conventionally, an exact Jacobian construction is employed ...
متن کاملJacobian matrix: a bridge between linear and nonlinear polynomial-only problems
By using the Hadamard matrix product concept, this paper introduces two generalized matrix formulation forms of numerical analogue of nonlinear differential operators. The SJT matrix-vector product approach is found to be a simple, efficient and accurate technique in the calculation of the Jacobian matrix of the nonlinear discretization by finite difference, finite volume, collocation, dual rec...
متن کامل